A Characterization of Lexicographic Max-Ordering Solutions
نویسنده
چکیده
In this paper we give the deenition of a solution concept in multicri-teria combinatorial optimization. We show how Pareto, max-ordering and lexicographically optimal solutions can be incorporated in this framework. Furthermore we state some properties of lexicographic max-ordering solutions , which combine features of these three kinds of optimal solutions. Two of these properties, which are desirable from a decison maker's point of view, are satissed if and only if the solution concept is that of lexico-graphic max-ordering.
منابع مشابه
Geometric Methods to Solve Max-Ordering Location Problems
Location problems with Q (in general connicting) criteria are considered. After reviewing previous results of the authors dealing with lexicographic and Pareto location the main focus of the paper is on max-ordering locations. In these location problems the worst of the single objectives is minimized. After discussing some general results (including reductions to single criterion problems and t...
متن کاملA lexicographic shellability characterization of geometric lattices
Geometric lattices are characterized as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are shown to be exactly those finite lattices such that every ordering on the join-irreducibles induces a lexicographic shelling. This new characterization fits into a similar ...
متن کاملDiscrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-ordering
The topic of this paper are discrete decision problems with multiple criteria. We rst deene discrete multiple criteria decision problems and introduce a classiication scheme for multiple criteria optimization problems. To do so we use multiple criteria optimization classes. The main result is a characterization of the class of lexicographic max-ordering problems by two very useful properties, r...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملLexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کامل